Beta-Shifts, Their Languages, and Computability
نویسندگان
چکیده
منابع مشابه
On Beta-Shifts Having Arithmetical Languages
Let β be a real number with 1 < β < 2. We prove that the language of the β-shift is ∆n iff β is a ∆n-real. The special case where n is 1 is the independently interesting result that the language of the β-shift is decidable iff β is a computable real. The “if” part of the proof is non-constructive; we show that for Walters’ version of the β-shift, no constructive proof exists.
متن کاملOn the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
We consider the computational complexity of languages of symbolic dynamical systems. In particular, we study complexity hierarchies and membership of the non-uniform class P/poly. We prove: 1. For every time-constructible, non-decreasing function t(n) = ω(n), there is a symbolic dynamical system with language decidable in deterministic time O(nt(n)), but not in deterministic time o(t(n)). 2. Fo...
متن کاملPermutations and Negative Beta-shifts
Elizalde (2011) characterized which permutations can be obtained by ordering consecutive elements in the trajectories of (positive) beta-transformations and beta-shifts. We prove similar results for negative bases beta.
متن کاملComputability, complexity, and languages - fundamentals of theoretical computer science
computability complexity and languages fundamentals of theoretical computer science What to say and what to do when mostly your friends love reading? Are you the one that don't have such hobby? So, it's important for you to start having that hobby. You know, reading is not the force. We're sure that reading will lead you to join in better concept of life. Reading will be a positive activity to ...
متن کاملBalanced Grammars and Their Languages
Balanced grammars are a generalization of parenthesis grammars in two directions. First, several kind of parentheses are allowed. Next, the set of right-hand sides of productions may be an infinite regular language. XML-grammars are a special kind of balanced grammars. This paper studies balanced grammars and their languages. It is shown that there exists a unique minimal balanced grammar equiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2009
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-009-9245-z